K_6 minors in 6-connected graphs of bounded tree-width
نویسندگان
چکیده
We prove that every sufficiently big 6-connected graph of bounded treewidth either has a K6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently big 6-connected graphs. Jørgensen conjectured that it holds for all 6-connected graphs. 8 April 2005, revised 4 September 2008. Partially supported by NSF under Grants No. DMS-0200595 and DMS-0701033. Partially supported by NSF under Grants No. DMS-0200595, DMS-0354742, and DMS-0701077.
منابع مشابه
Tree-depth and Vertex-minors
In a recent paper [6], Kwon and Oum claim that every graph of bounded rank-width is a pivot-minor of a graph of bounded tree-width (while the converse has been known true already before). We study the analogous questions for “depth” parameters of graphs, namely for the tree-depth and related new shrub-depth. We show that shrub-depth is monotone under taking vertex-minors, and that every graph c...
متن کاملTree-width and the monadic quantifier hierarchy
It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is closed under minors, then K contains all planar graphs. But on planar graphs, three-colorability ...
متن کاملLINKED TREE-DECOMPOSITIONS OF INFINITE REPRESENTED MATROIDS By
It is natural to try to extend the results of Robertson and Seymour’s Graph Minors Project to other objects. As linked tree-decompositions (ltds) of graphs played a key role in the Graph Minors Project, establishing the existence of ltds of other objects is a useful step towards such extensions. There has been progress in this direction for both infinite graphs and matroids. Kříž and Thomas pro...
متن کاملBranch-Width and Well-Quasi-Ordering in Matroids and Graphs
We prove that a class of matroids representable over a fixed finite field and with bounded branch-width is well-quasi-ordered under taking minors. With some extra work, the result implies Robertson and Seymour’s result that graphs with bounded tree-width (or equivalently, bounded branch-width) are well-quasi-ordered under taking minors. We will not only derive their result from our result on ma...
متن کاملKa, k Minors in Graphs of Bounded Tree-Width
It is shown that for any positive integers k and w there exists a constant N = N(k, w) such that every 7-connected graph of tree-width less than w and of order at least N contains K3,k as a minor. Similar result is proved for Ka,k minors where a is an arbitrary fixed integer and the required connectivity depends only on a. These are the first results of this type where fixed connectivity forces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1203.2171 شماره
صفحات -
تاریخ انتشار 2005